Early Steps of Second-Order Quantifier Elimination beyond the Monadic Case: The Correspondence between Heinrich Behmann and Wilhelm Ackermann 1928-1934 (Abstract)

نویسنده

  • Christoph Wernhard
چکیده

This presentation focuses on the span between two early seminal papers on second-order quantifier elimination on the basis of first-order logic: Heinrich Behmann’s Habilitation thesis Beiträge zur Algebra der Logik, insbesondere zum Entscheidungsproblem (Contributions to the algebra of logic, in particular to the decision problem), published in 1922 as [4], and Wilhelm Ackermann’s Untersuchungen über das Eliminationsproblem der mathematischen Logik (Investigations on the elimination problem of mathematical logic) from 1935 [2]. Behmann developed in [4] a method to decide relational monadic formulas (that is, first-order formulas with only unary predicates and no functions other than constants, also known as Löwenheim class) that actually proceeds by performing second-order quantifier elimination with a technique that improves Schröder’s rough-and-ready resultant (Resultante aus dem Rohen) [22,10]. If all predicates are existentially quantified, then elimination yields either a truth value constant or a formula that just expresses with counting quantifiers a cardinality constraint on the domain. Although technically related to earlier works by Löwenheim [16] and Skolem [23,24], Behmann’s presentation appears quite modern from the view of computational logic: He shows a method that proceeds by equivalence preserving formula rewriting until a normal form is achieved in which second-order subformulas have a certain shape for which the elimination result is known [27,26]. Ackermann laid in [2] the foundation for the two major modern paradigms of second-order quantifier elimination, the resolution-based approach [12], and the so-called direct or Ackermann approach [11,13,21], which is like Behmann’s method based on formula rewriting until second-order subformulas have a certain shape for which the elimination result is known, however, now based on more powerful equivalences of secondto first-order formulas, such as Ackermann’s Lemma. Another result of Ackermann’s paper was a proof that second-order quantifier elimination on the basis of first-order logic does not succeed in general. As documented by letters and manuscripts in Behmann’s scientific bequest [6], between 1922 and 1935 Behmann and Ackermann both thought about possibilities to extend elimination to formulas with predicates of arity two or more. Behmann gave in 1926 at the Jahresversammlung der Deutschen Mathematiker102

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic

For relational monadic formulas (the Löwenheim class) second-order quantifier elimination, which is closely related to computation of uniform interpolants, projection and forgetting – operations that currently receive much attention in knowledge processing – always succeeds. The decidability proof for this class by Heinrich Behmann from 1922 explicitly proceeds by elimination with equivalence p...

متن کامل

Towards Elimination of Second-Order Quantifiers in the Separated Fragment

It is a classical result that the monadic fragment of secondorder logic admits elimination of second-order quantifiers. Recently, the separated fragment (SF) of first-order logic has been introduced. SF generalizes the monadic first-order fragment without equality, while preserving decidability of the satisfiability problem. Therefore, it is a natural question to ask whether SF also admits elim...

متن کامل

The Boolean Solution Problem from the Perspective of Predicate Logic (Abstract)

Finding solution values for unknowns in Boolean equations was, along with second-order quantifier elimination, a principal reasoning mode in the Algebra of Logic of the 19th century. Schröder [19] investigated it as Auflösungsproblem (solution problem). It is closely related to the modern notion of Boolean unification. For a given formula that contains unknowns formulas are sought such that aft...

متن کامل

No . 5 , “ Problems of Theoretical Logic ”

In the period 1914–1922, a significant amount of work on logic was carried out in Göttingen. Beginning in 1914, Hilbert and his students, in particular Heinrich Behmann, were studying Whitehead and Russell’s Principia Mathematica, which resulted in Behmann’s dissertation (1918, see Mancosu 1999). In the Fall of 1917, Paul Bernays joined Hilbert in Göttingen and from then on worked as his assist...

متن کامل

Cardinality Quantifiers in MLO over Trees

We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets”. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017